Łukasiewicz Logics and Prime Numbers

نویسنده

  • Alexander S. Karpenko
چکیده

A catalog record is available from the Library of Congress. All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without permission in writing from the copyright holder. While every attempt is made to ensure that the information in this publication is correct, no liability can be accepted by the authors or publishers for loss, damage or injury caused by any errors in, or omission from, the information given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Hard Instances of Satisfiability in Łukasiewicz Logics∗

One aspect that has been poorly studied in multiplevalued logics, and in particular in Łukasiewicz logics, is the generation of instances of varying difficulty for evaluating, comparing and improving satisfiability solvers. In this paper we present a new class of clausal forms, called Łukasiewicz (Ł-)clausal forms, motivate their usefulness, study their complexity, and report on an empirical in...

متن کامل

Compactness of fuzzy logics

This contribution is concerned with the compactness of fuzzy logics, where we concentrate on the three standard fuzzy logics—Łukasiewicz logic, Gödel logic, and product logic.

متن کامل

On Qualified Cardinality Restrictions in Fuzzy Description Logics under Łukasiewicz semantics

Fuzzy Description Logics have been proposed as a family of languages to describe vague or imprecise structured knowledge. This work deals with one of the less studied constructors, qualified cardinality restrictions, showing some counter-intuitive behaviours under Łukasiewicz semantics, and proposing a new semantics and the corresponding reasoning algorithm.

متن کامل

Secure and Optimal Base Contraction in Graded Łukasiewicz Logics

The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Nevertheless, in the general case, this notion is inadequate for revision, where it is replaced by maximal consistent subsets. A natural question is whether this latter notion allows for a definition of contraction-like operators and, in case it does, what diff...

متن کامل

Complexity of Fuzzy Probability Logics

The satisfiability problem for the logic FP(Ł) (fuzzy probability logic over Łukasiewicz logic) is shown to be NP-complete; satisfiability in FP(ŁΠ) (the same over the logic joining Łukasiewicz and product logic) is shown to be in PSPACE.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012